On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
نویسندگان
چکیده
We prove a general finite convergence theorem for “upward-guarded” fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual convergence of fixpoint computations. In particular, we are able to directly obtain several new decidability results on lossy channel systems.
منابع مشابه
Computable fixpoints in well-structured symbolic model checking
We prove a general finite-time convergence theorem for fixpoint expressions over a well-quasi-ordered set. This has immediate applications for the verification of well-structured systems, where a main issue is the computability of fixpoint expressions, and in particular for game-theoretical properties and probabilistic systems where nesting and alternation of least and greatest fixpoints are co...
متن کاملModel Checking Probabilistic Lossy Channel Systems
Lossy channel systems model a set of nite state processes interacting with each other over unbounded, lossy FIFO channels. This computational model is an abstraction of protocols in the lower layers of the network protocol hierarchy. In spite of its unbounded FIFO queues the Lossy channel system model is not turing-powerful. It has been shown that the reachability problem is decidable 1]. Howev...
متن کاملModel Checking Lossy Vector Addition Systems
Lossy VASS (vector addition systems with states) are deened as a subclass of VASS in analogy to lossy FIFO-channel systems. They can be used to model concurrent systems with unreliable communication. We analyze the decidability of model checking problems for lossy systems and several branching-time and linear-time temporal logics. We present an almost complete picture of the decidability of mod...
متن کاملUsing Forward Reachability Analysis for Verification of Lossy Channel Systems
We consider symbolic on-they veriication methods for systems of nite-state machines that communicate by exchanging messages via unbounded and lossy FIFO queues. We propose a novel representation formalism, called simple regular expressions (SREs), for representing sets of states of protocols with lossy FIFO channels. We show that the class of languages representable by SREs is exactly the class...
متن کاملSubwords: automata, embedding problems, and verification
The increasing use of software and automated systems has made it important to ensure their correct behaviour. Bugs can not only have significant financial costs, but also catastrophic consequences in mission-critical systems. Testing against a variety of environments and inputs helps with discovering bugs, but cannot guarantee their absence. Formal verification is the technique that establishes...
متن کامل